Note on MAX 2SAT
نویسندگان
چکیده
In this note we present an approximation algorithm for MAX 2SAT that given a (1− ε) satisfiable instance finds an assignment of variables satisfying a 1−O( √ ε) fraction of all constraints. This result is optimal assuming the Unique Games Conjecture. The best previously known result, due to Zwick, was 1−O(ε1/3). We believe that the analysis of our algorithm is much simpler than the analysis of Zwick’s algorithm.
منابع مشابه
New Approximation Algorithms for Max 2sat and Max Dicut
We propose a 0.935-approximation algorithm for MAX 2SAT and a 0.863-approximation algorithm for MAX DICUT. The approximation ratios improve upon the recent results of Zwick, which are equal to 0.93109 and 0.8596434254 respectively. Also proposed are derandomized versions of the same approximation ratios. We note that these approximation ratios are obtained by numerical computation rather than t...
متن کاملOn Weighted vs Unweighted Versions of Combinatorial Optimization Problems
We investigate the approximability properties of several weighted problems, by comparing them with the respective unweighted problems. For an appropriate (and very general) definition of niceness, we show that if a nice weighted problem is hard to approximate within r, then its polynomially bounded weighted version is hard to approximate within r − o(1). Then we turn our attention to specific p...
متن کاملAverage-Case Analysis for the MAX-2SAT Problem
We propose a simple probability model for MAX-2SAT instances for discussing the average-case complexity of the MAX-2SAT problem. Our model is a “planted solution model”, where each instance is generated randomly from a target solution. We show that for a large range of parameters, the planted solution (more precisely, one of the planted solution pair) is the optimal solution for the generated i...
متن کاملImproved Approximation Algorithms for Max-2SAT with Cardinality Constraint
The optimization problem Max-2SAT-CC is Max-2SAT with the additional cardinality constraint that the value one may be assigned to at most K variables. We present an approximation algorithm with polynomial running time for Max-2SAT-CC. This algorithm achieves, for any > 0, approximation ratio 6+3·e 16+2·e − ≈ 0.6603. Furthermore, we present a greedy algorithm with running time O(N logN) and appr...
متن کاملA Theorist’s Toolkit
(a) Show that, similarly to Max Cut, the Max 2SAT problem can be expressed as an integer quadratic program in which the only constraints are yi ∈ {1,−1} and the objective function is a quadratic in the yi. (Hint: It may help to introduce a variable y0 to designate which of 1 or −1 indicates “true”.) (b) Derive a factor αGW ≈ 0.87856 approximation algorithm for Max 2SAT. (c) Consider the restric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 13 شماره
صفحات -
تاریخ انتشار 2006